Parallel Simulation of Quantum Search
نویسندگان
چکیده
منابع مشابه
Speedup of Iterated Quantum Search by Parallel Performance
Given a sequence f1(x1), f2(x1, x2), . . . , fk(x1, . . . , xk) of boolean functions, each fi takes the value 1 at a single point of the form x 0 1, x 0 2, . . . , xi , i " 1, 2, . . . , k. The length of all xi is n, N " 2n. It is shown how to find xk (k # 2) using kΠ ! N/4 ! 2 simultaneous evaluations of functions of the form fi, fi%1 with an error probability of order k/ ! N. This is ! 2 time...
متن کاملSimulation of Quantum Adiabatic Search in the Presence of Noise
Results are presented of a large-scale simulation of the quantum adiabatic search (QuAdS) algorithm in the presence of noise. The algorithm is applied to the NP–Complete problem N–Bit Exact Cover 3 (EC3). The noise is assumed to Zeeman-couple to the qubits and its effects on the algorithm’s performance is studied for various levels of noise power, and for 4 different types of noise polarization...
متن کاملSimulation of Direct Pumping of Quantum Dots in a Quantum Dot Laser
In this paper, the nonlinear rate equations governing a quantum dot laser isused to simulate the transient as well as the steady-state behaviors of the laser.Computation results show that the rate equations are capable of simulating true behaviorof a quantum dot laser. Then, the pump rates of the rate equations (which show indirectelectrical pumping of the quantum dots through a wetting layer) ...
متن کاملParallel Direct Search Methods for Simulation-based Optimization
In many engineering disciplines, the use of realistic computing models has become an invaluable tool in the design process. Complex simulation codes are able to approximate the behavior of intricate systems or the properties of components without the need for costly physical experimentation. Optimization algorithms can be used to automatically find the set of parameters within the design space ...
متن کاملLow-Communication Parallel Quantum Multi-Target Preimage Search
The most important pre-quantum threat to AES-128 is the 1994 van Oorschot–Wiener “parallel rho method”, a low-communication parallel pre-quantum multi-target preimage-search algorithm. This algorithm uses a mesh of p small processors, each running for approximately 2/pt fast steps, to find one of t independent AES keys k1, . . . , kt, given the ciphertexts AESk1(0), . . . ,AESkt(0) for a shared...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computers Communications & Control
سال: 2010
ISSN: 1841-9836,1841-9836
DOI: 10.15837/ijccc.2010.5.2219